منابع مشابه
Range LCP
In this paper, we define the Range LCP problem as follows. Preprocess a string S, of length n, to enable efficient solutions of the following query: Given [i, j], 0 < i ≤ j ≤ n, compute max`,k∈{i,...,j} LCP (S`, Sk), where LCP (S`, Sk) is the length of the longest common prefix of the suffixes of S starting at locations ` and k. This is a natural generalization of the classical LCP problem. Sur...
متن کاملWee LCP
We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are sufficient to answer LCP-queries asymptotically in the same time that is needed to retrieve an entry from the suffix array. This yields the smallest compressed suffix tree with sublog...
متن کاملInducing the LCP-Array
We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC’09) such that it computes the array of longest common prefixes (LCP-array) as well. Practical tests show that this outperforms recent LCP-array construction algorithms (Gog and Ohlebusch, ALENEX’11).
متن کاملSynthes Locking Compression Plate (lcp) System
The advent of internal fixation with bone plates and screws represents a tremendous advancement in the methods of fracture fixation. During this era, the emphasis was on anatomic reconstruction and rigid internal fixation. Although these principles are applicable to a great number of fractures, not all can be treated in this manner. In fact, the disruption of the soft tissue envelope required t...
متن کاملFaster External Memory LCP Array Construction
The suffix array, perhaps the most important data structure in modern string processing, needs to be augmented with the longest-common-prefix (LCP) array in many applications. Their construction is often a major bottleneck especially when the data is too big for internal memory. We describe two new algorithms for computing the LCP array from the suffix array in external memory. Experiments demo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2014
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.02.010